Visible Vectors and Discrete Euclidean Medial Axis
نویسندگان
چکیده
We denote by M R the test neighbourhood sufficient to extract the Euclidean Medial Axis of any n-dimensional discrete shape whose inner radius is no greater than R. In this paper, we study properties of discrete Euclidean disks overlappings so as to prove that in any given dimension n, M R tends to the set of visible vectors as R tends to infinity.
منابع مشابه
Efficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron
AVNEESH SUD: Efficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron. (Under the direction of Dinesh Manocha.) The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the ...
متن کاملFinding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may exist without changing the reversivility of the input shape representation. In this article, we first prove that finding a minimum medial axis is an NP-hard problem for the Euclidean distance. Then, we compare two algo...
متن کاملExact Euclidean Medial Axis in Higher Resolution
The notion of skeleton plays a major role in shape analysis. Some usually desirable characteristics of a skeleton are: sufficient for the reconstruction of the original object, centered, thin and homotopic. The Euclidean Medial Axis presents all these characteristics in a continuous framework. In the discrete case, the Exact Euclidean Medial Axis (MA) is also sufficient for reconstruction and c...
متن کاملFarey Sequences and the Planar Euclidean Medial Axis Test Mask
The Euclidean test mask T (r) is the minimum neighbourhood sufficient to detect the Euclidean Medial Axis of any discrete shape whose inner radius does not exceed r. We establish a link between T (r) and the well-known Farey sequences, which allows us to propose two new algorithms. The first one computes T (r) in time O(r) and space O(r). The second one computes for any vector − →v the smallest...
متن کاملVolumetric analysis of digital objects using distance transformation: performance issues and applications
In binary images, the distance transformation (DT) and the geometrical medial axis are classic tools for shape analysis. In the digital geometry literature, recent articles have demonstrated that fast algorithms can be designed without any approximation of the Euclidean metric. The aim of the paper is to first give an overview of separable techniques to compute the distance transformation, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 42 شماره
صفحات -
تاریخ انتشار 2009